SHAH: Hash Function Based on Irregularly Decimated Chaotic Map
نویسندگان
چکیده
In this paper, we propose a novel hash function based on irregularly decimated chaotic map. The called SHAH is two Tinkerbell maps filtered with irregular decimation rule. Exact study has been provided the scheme using distribution analysis, sensitivity static analysis of diffusion and confusion, collision analysis. experimental data show that satisfied admirable level security.
منابع مشابه
study of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
A novel parallel hash function based on 3D chaotic map
As the core of cryptography, hash function is one of the basic techniques for information security. During the last few years, considerable effort has been devoted to research on chaos-based hash functions. Nevertheless, the corresponding analysis of them lag far behind. In this paper, a new efficient scheme for parallel hash function based on high-dimensional chaotic map is proposed. In the pr...
متن کاملSide Channel Attacks on Irregularly Decimated Generators
We investigate three side channel attacks on ABSG, a variant of irregularly decimated generators (IDG). The three attacks are timing analysis, phase-shift fault analysis and bit-flipping fault analysis. We also modify the attacks to non side-channel cryptanalyses, but on the assumption that the key/IV mixing is not well designed. This paper hopes to provide more understanding on actual hardware...
متن کاملAn Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کاملDesign and evaluation of chaotic iterations based keyed hash function
Investigating how to construct a secure hash algorithm needs in-depth study, as various existing hash functions like the MD5 algorithm have recently exposed their security flaws. At the same time, hash function based on chaotic theory has become an emerging research in the field of nonlinear information security. As an extension of our previous research works, a new chaotic iterations keyed has...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Electronics and Telecommunications
سال: 2023
ISSN: ['2300-1933', '2081-8491']
DOI: https://doi.org/10.24425/123546